/*
ID: pallab81
PROG:
LANG: C++
*/

//"I have not failed, I have just found 10000 ways that won't work.

#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;

#define VI vector< int >
#define CI( x ) scanf("%d",&x)
#define CL( x ) scanf("%lld",&x)
#define CD( x ) scanf("%lf",&x )
#define foR(i,st,ed) for(int i = st ; i < ed ; ++i )
#define fo(i,ed) foR( i , 0 , ed )
#define foE(i,st,ed) for(int i = st ; i <= ed ; ++i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define f first
#define s second
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )

class PowerPlants {
public:
    int minCost(vector <string> connectionCost, string plantList, int numPlants);
};
int g[20][20];
int N;
int K;

inline int f(char ch) {
    if ( isdigit(ch) ) {
        return ( ch-'0' ) ;
    }
    return ( (ch-'A') +10 );
}
int dp[1<<20];
inline int OR(int x, int bit) {
    return ( x|(1<<bit) ) ;
}
inline int AND(int x, int bit) {
    return ( x&(1<<bit) ) ;
}
int go(int msk) {
    if ( __builtin_popcount(msk)>=K ) {
        return 0;
    }
    if ( dp[msk]!=-1 )return dp[msk];


    int best = (int)1023456789;
    for (int j=0; j<N; ++j) {
        if ( AND(msk,j)!=0 ) {
            for (int i=0;i<N;++i) {
                if ( AND(msk,i)==0 ) {
                    int v = g[j][i]+go(OR(msk,i));
                    best = min( best, v );
                }
            }
        }
    }
    return dp[msk]=best;
}
int PowerPlants :: minCost(vector <string> connectionCost, string plantList, int numPlants) {

    N = SZ(connectionCost);
    fo(i,N) {
        fo(j,N) {
            g[i][j] = f( connectionCost[i][j] ) ;
        }
    }
    K = numPlants;
    int msk = 0;
    fo(i,LN(plantList)) {
        if ( plantList[i]=='Y' ) {
            msk = OR(msk,i);
        }
    }
    SET(dp,-1);
    int retval = go(msk);

    return retval;
}
// BEGIN KAWIGIEDIT TESTING
// Generated by KawigiEdit 2.1.8 (beta) modified by pivanof
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool KawigiEdit_RunTest(int testNum, vector <string> p0, string p1, int p2, bool hasAnswer, int p3) {
    cout << "Test " << testNum << ": [" << "{";
    for (int i = 0; int(p0.size()) > i; ++i) {
        if (i > 0) {
            cout << ",";
        }
        cout << "\"" << p0[i] << "\"";
    }
    cout << "}" << "," << "\"" << p1 << "\"" << "," << p2;
    cout << "]" << endl;
    PowerPlants *obj;
    int answer;
    obj = new PowerPlants();
    clock_t startTime = clock();
    answer = obj->minCost(p0, p1, p2);
    clock_t endTime = clock();
    delete obj;
    bool res;
    res = true;
    cout << "Time: " << double(endTime - startTime) / CLOCKS_PER_SEC << " seconds" << endl;
    if (hasAnswer) {
        cout << "Desired answer:" << endl;
        cout << "\t" << p3 << endl;
    }
    cout << "Your answer:" << endl;
    cout << "\t" << answer << endl;
    if (hasAnswer) {
        res = answer == p3;
    }
    if (!res) {
        cout << "DOESN'T MATCH!!!!" << endl;
    } else if (double(endTime - startTime) / CLOCKS_PER_SEC >= 2) {
        cout << "FAIL the timeout" << endl;
        res = false;
    } else if (hasAnswer) {
        cout << "Match :-)" << endl;
    } else {
        cout << "OK, but is it right?" << endl;
    }
    cout << "" << endl;
    return res;
}
int main() {
    bool all_right;
    all_right = true;

    vector <string> p0;
    string p1;
    int p2;
    int p3;

    {
        // ----- test 0 -----
        string t0[] = {"024","203","430"};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        p1 = "YNN";
        p2 = 3;
        p3 = 5;
        all_right = KawigiEdit_RunTest(0, p0, p1, p2, true, p3) && all_right;
        // ------------------
    }

    {
        // ----- test 1 -----
        string t0[] = {"0AB","A0C","CD0"};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        p1 = "YNN";
        p2 = 3;
        p3 = 21;
        all_right = KawigiEdit_RunTest(1, p0, p1, p2, true, p3) && all_right;
        // ------------------
    }

    {
        // ----- test 2 -----
        string t0[] = {"1ABCD","35HF8","FDM31","AME93","01390"};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        p1 = "NYNNN";
        p2 = 5;
        p3 = 14;
        all_right = KawigiEdit_RunTest(2, p0, p1, p2, true, p3) && all_right;
        // ------------------
    }

    {
        // ----- test 3 -----
        string t0[] = {"012","123","234"};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        p1 = "NNY";
        p2 = 2;
        p3 = 2;
        all_right = KawigiEdit_RunTest(3, p0, p1, p2, true, p3) && all_right;
        // ------------------
    }

    {
        // ----- test 4 -----
        string t0[] = {"1309328","DS2389U","92EJFAN","928FJNS","FJS0DJF","9FWJW0E","23JFNFS"};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        p1 = "YYNYYNY";
        p2 = 4;
        p3 = 0;
        all_right = KawigiEdit_RunTest(4, p0, p1, p2, true, p3) && all_right;
        // ------------------
    }

    {
        // ----- test 5 -----
        string t0[] = {"01","20"};
        p0.assign(t0, t0 + sizeof(t0) / sizeof(t0[0]));
        p1 = "YN";
        p2 = 2;
        p3 = 1;
        all_right = KawigiEdit_RunTest(5, p0, p1, p2, true, p3) && all_right;
        // ------------------
    }

    if (all_right) {
        cout << "You're a stud (at least on the example cases)!" << endl;
    } else {
        cout << "Some of the test cases had errors." << endl;
    }
    return 0;
}
// END KAWIGIEDIT TESTING


//Powered by KawigiEdit 2.1.8 (beta) modified by pivanof!
// kate: indent-mode cstyle; space-indent on; indent-width 0; 
